Optimal security-constrained power scheduling by Benders decomposition
نویسندگان
چکیده
منابع مشابه
Accelerating the Composite Power System Planning by Benders Decomposition
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
متن کاملRobust Scheduling with Logic-Based Benders Decomposition
We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty se...
متن کاملaccelerating the composite power system planning by benders decomposition
this paper presents an application of benders decomposition to deal with the complexities in the simultaneous generation expansion planning (gep) and transmission expansion planning (tep). unlike the power system operation fields of study, the power system planning methods are not expected to be fast. however, it is always preferable to speed up computations to provide more analysis options for...
متن کاملSingle-facility scheduling by logic-based Benders decomposition
Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizon...
متن کاملPlanning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electric Power Systems Research
سال: 2007
ISSN: 0378-7796
DOI: 10.1016/j.epsr.2006.06.009